Application Note: Scalable HashingProblem How can you use Judy to create a scalable hash table with outstanding performance and automatic scaling, while avoiding the complexity of dynamic hashing?

Source URL: judy.sourceforge.net

• Search algorithms
• Information science
• Information retrieval
• Hashing
• Computer programming
• Hash table
• Hash function
• Trie
• Judy array
• Hash
• Cuckoo hashing
• 2-choice hashing

Succinct Sampling from Discrete Distributions ∗ † Karl Bringmann

Source URL: people.mpi-inf.mpg.de

• Arrays
• Computing
• Computer science
• Analysis of algorithms
• Probabilistic complexity theory
• Randomized algorithm
• Entropy
• Computer programming
• Bit array
• Dynamic connectivity
• Locality-sensitive hashing

THE COMPUTATIONAL COMPLEXITY OF CONVEX BODIES Alexander Barvinok and Ellen Veomett October 2006 Abstract. We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X f

Source URL: www.math.lsa.umich.edu

• Geometry
• Mathematics
• Space
• Polytopes
• Operations research
• Convex analysis
• Real algebraic geometry
• Linear algebra
• Simplex
• Linear programming
• Mathematical optimization
• Convex hull

Introduction to Algorithms Lecture 10 Prof. Piotr Indyk

Source URL: courses.csail.mit.edu

• Sorting algorithms
• Order theory
• Mathematics
• Computer programming
• Merge sort
• B-tree
• Heapsort
• Insertion sort
• Comparison sort
• Tree
• Decision tree model
• Time complexity

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011

Source URL: courses.csail.mit.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• Analysis of algorithms
• Operations research
• Asymptotic analysis
• Combinatorial optimization
• Dynamic programming
• Master theorem
• Big O notation
• Knapsack problem
• Time complexity

The Computational Power and Complexity of Constraint Handling Rules JON SNEYERS, TOM SCHRIJVERS, and BART DEMOEN K.U.Leuven Constraint Handling Rules (CHR) is a high-level rule-based programming language which is

Source URL: people.cs.kuleuven.be

Magnús Már Halldórsson ICE-TCS, School of Computer Science Reykjavik University 101 Reykjavik, Iceland

Source URL: www.ru.is

• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• Theoretical computer science
• Maximum cut
• Approximation algorithm
• International Colloquium on Automata
• Languages and Programming
• Algorithmica
• Halldrsson
• International Symposium on Algorithms and Computation
• European Symposium on Algorithms
• Graph coloring

Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 The Work of Daniel A. Spielman Gil Kalai Dan Spielman has made groundbreaking contributions in theoretical computer

Source URL: www.icm2010.in

• Mathematics
• Computational complexity theory
• Computer science
• Analysis of algorithms
• Linear programming
• Operations research
• Mathematical optimization
• Smoothed analysis
• KleeMinty cube
• Simplex algorithm
• Daniel Spielman
• Algorithm

CSL Technical Report SRI-CSL-06-01 • May 23, 2006 Integrating Simplex with DPLL(T ) Bruno Dutertre and Leonardo de Moura This report is based upon work supported by the Defense Advanced Research Projects

Source URL: yices.csl.sri.com

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Electronic design automation
• Formal methods
• Logic in computer science
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Simplex algorithm